NLP Formulation for Polygon Optimization Problems
نویسندگان
چکیده
منابع مشابه
A New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems
One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...
متن کاملUnconstrained formulation of standard quadratic optimization problems
A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadra...
متن کاملQuartic Formulation of Standard Quadratic Optimization Problems
A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadra...
متن کاملOPTIMIZATION FORMULATION FOR NONLINEAR STRUCTURAL ANALYSIS
In this paper, the effect of angle between predictor and corrector surfaces on the structural analysis is investigated. Two objective functions are formulated based on this angle and also the load factor. Optimizing these functions, and using the structural equilibrium path’s geometry, lead to two new constraints for the nonlinear solver. Besides, one more formula is achieved, which was p...
متن کاملOptimal Parallel Hypercube Algorithms for Polygon Problems
We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(logn)-lime, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-verlex simple polygon P for monotonicity, and other related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2018
ISSN: 2227-7390
DOI: 10.3390/math7010024